Distributive Congruence Lattices of Congruence-permutable Algebras
نویسنده
چکیده
We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence neither of any group nor of any module), thus solving negatively a problem of E. T. Schmidt from 1969. Furthermore, D may be taken as the congruence lattice of the free bounded lattice on א2 generators in any non-distributive lattice variety. Some of our results are obtained via a functorial approach of the semilatticevalued ‘distances’ used by B. Jónsson in his proof of Whitman’s embedding Theorem. In particular, the semilattice of compact elements of D is not the range of any distance satisfying the V-condition of type 3/2. On the other hand, every distributive 〈∨, 0〉-semilattice is the range of a distance satisfying the V-condition of type 2. This can be done via a functorial construction.
منابع مشابه
Axiomatizable and Nonaxiomatizable Congruence Prevarieties
If V is a variety of algebras, let L(V) denote the prevariety of all lattices embeddable in congruence lattices of algebras in V . We give some criteria for the first-order axiomatizability or nonaxiomatizability of L(V). One corollary to our results is a nonconstructive proof that every congruence n-permutable variety satisfies a nontrivial congruence identity.
متن کاملVarieties Whose Tolerances Are Homomorphic Images of Their Congruences
The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic images of their congruences (TImC). As corollaries, we prove that the variety of semilattices, all varieties of lattices, and all varieties of unary algebras h...
متن کاملA Note on Congruence Systems of Ms-algebras
Let A be an algebra. We use Con(A) to denote the congruence lattice of A. We say that θ, δ ∈ Con(A) permute if θ∨δ = {(x, y) ∈ A: there is z ∈ A such that (x, z) ∈ θ and (z, y) ∈ δ}. The algebra A is congruence permutable (permutable for short) if every pair of congruences in Con(A) permutes. By a system on A we understand a 2n-tuple (θ1, . . . , θn;x1, . . . , xn), where θ1, . . . , θn ∈ Con(A...
متن کاملIDEMPOTENT n-PERMUTABLE VARIETIES
One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for some n. In this paper we prove two results: (1) For every n > 1 there is a polynomial-time algorithm which, given a finite idempotent algebra A in a finite language, determines whether the variety generated by A is n-permutable; (2) A variety is n-permutable for so...
متن کاملPrincipal and Syntactic Congruences in Congruence-distributive and Congruence-permutable Varieties
We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite. 2000 Mathematics subject classification: 08B10.
متن کامل